A DUALITY BETWEEN ALGEBRAS OF BASIC LOGIC AND BOUNDED REPRESENTABLE DRl-MONOIDS

نویسنده

  • Jiří Rachůnek
چکیده

BL-algebras, introduced by P.Hájek, form an algebraic counterpart of the basic fuzzy logic. In the paper it is shown that BL-algebras are the duals of bounded representable DRl-monoids. This duality enables us to describe some structure properties of BL-algebras.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Filter Theory of Bounded Residuated Lattice Ordered Monoids

Bounded residuated lattice ordered monoids (R -monoids) are a common generalization of pseudo-BL-algebras and Heyting algebras, i.e. algebras of the non-commutative basic fuzzy logic (and consequently of the basic fuzzy logic, the Łukasiewicz logic and the non-commutative Łukasiewicz logic) and the intuitionistic logic, respectively. In the paper we introduce and study classes of filters of bou...

متن کامل

Monadic Bounded Commutative Residuated l-monoids

An algebra M = (M ; ,∨,∧,→, 0, 1) of type 〈2, 2, 2, 2, 0, 0〉 is called a bounded commutative R`-monoid iff (i) (M ; , 1) is a commutative monoid, (ii) (M ;∨,∧, 0, 1) is a bounded lattice, and (iii) x y ≤ z ⇐⇒ x ≤ y → z, (iv) x (x → y) = x ∧ y, for each x, y, z ∈ M . In the sequel, by an R`-monoid we will mean a bounded commutative R`-monoid. (Note that bounded commutative R`-monoids are just bo...

متن کامل

Classes of Fuzzy Filters of Residuated Lattice Ordered Monoids

The logical foundations of processes handling uncertainty in information use some classes of algebras as algebraic semantics. Bounded residuated lattice ordered monoids (Rl-monoids) are common generalizations of BL-algebras, i.e., algebras of the propositional basic fuzzy logic, and Heyting algebras, i.e., algebras of the propositional intuitionistic logic. From the point of view of uncertain i...

متن کامل

Fuzzy filters and fuzzy prime filters of bounded R

The logical foundations of processes handling uncertainty in information use some classes of algebras as algebraic semantics. The sets of provable formulas in corresponding inference systems from the point of view of uncertain information can be described by fuzzy filters of those algebraic semantics. Bounded residuated lattice ordered monoids (R`-monoids) are a common generalization of pseudo ...

متن کامل

Priestley duality for N4-lattices

We present a new Priestley-style topological duality for bounded N4-lattices, which are the algebraic counterpart of paraconsistent Nelson logic. Our duality differs from the existing one, due to Odintsov, in that we only rely on Esakia duality for Heyting algebras and not on the duality for De Morgan algebras of Cornish and Fowler. A major advantage of our approach is that for our topological ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999